Automatic Near-Body Domain Decomposition Using the Eikonal Equation
نویسندگان
چکیده
The purpose of this research is to generate high-aspect-ratioc ellsf or structured grids in the vicinity of boundaries for wall dominated phenomenas ucha sv iscous layers in aerodynamic applications. When suchd omains are discretized for complex geometries, it is importantt hat the grid fits the boundaries well, andt his becomes even more difficultt oa chievew ith strongly curved boundaries. Domain decomposition simplifies this problem by subdividing the domain into multiple blocksa nd makes the task of meshing complex geometries more manageable. There are manyb enefits to using am ulti-block strategy.I ti sp ossiblet oc on-trol the orthogonalitya nd grid quality more preciselyw ithin smallerb locks, and it allows differentm esh typesa nd generation techniques in eachi ndividual block. Also, parallel algorithms can be embedded in the mesh generation algorithm, where differentb locksc an be assigned to differentp rocessors, thus greatly improving the efficiency of the process. The presentp aper introduces an approacht oa utomatically decompose an arbitrary complex domain into face-matching multi-blockse manating from the boundaries. The subdivision procedure is based on the creation of offset surfaces which closelyfi tt heir geometries instead of arbitrary planes or surfaces. Thisfi tting is achieved through aw eak solution of the Offset DistanceF unction,w hichi sav aria-tion of the Eikonal equation. Computing the normal directions in this manner insures that they do not cross, and the resulting propagation avoids self-intersections which arise from direct construction methods. Thus thism ethodc an be applied on an arbitrary complex domain, i.e.,acon-cave,o raconvexs hape, it mayh ave sharp corners, or even be multi-connected. In addition,t he proposed methodt ransports the original parameterization to the propagated surface whicha llows rigorousm atching of block faces. The geometric and topological configurations are thus well defined whicha llows to increaset he automation levelw ithoutu ser intervention.
منابع مشابه
High-Order Factorization Based High-Order Hybrid Fast Sweeping Methods for Point-Source Eikonal Equations
The solution for the eikonal equation with a point-source condition has an upwind singularity at the source point as the eikonal solution behaves like a distance function at and near the source. As such, the eikonal function is not differentiable at the source so that all formally high-order numerical schemes for the eikonal equation yield first-order convergence and relatively large errors. Th...
متن کاملProviding a structural model for psychological problems based on disconnection and rejection domain and negative automatic thoughts with mediating role of experimental avoidance
Introduction: Psychological problems are the result of a person's interaction with the environment and include behaviors that cause social conflicts, dissatisfaction and individual unhappiness. The present study aimed to provide a structural model for psychological problems based on disconnection and rejection domain and negative automatic thoughts with mediating role of experimental avoidance....
متن کاملOptimal Control of Light Propagation Governed by Eikonal Equation within Inhomogeneous Media Using Computational Adjoint Approach
A mathematical model is presented in the present study to control the light propagation in an inhomogeneous media. The method is based on the identification of the optimal materials distribution in the media such that the trajectories of light rays follow the desired path. The problem is formulated as a distributed parameter identification problem and it is solved by a numerical met...
متن کاملEfficient Algorithms for Image and High Dimensional Data Processing Using Eikonal Equation on Graphs
In this paper we propose an adaptation of the static eikonal equation over weighted graphs of arbitrary structure using a framework of discrete operators. Based on this formulation, we provide explicit solutions for the L1,L2 and L∞ norms. Efficient algorithms to compute the explicit solution of the eikonal equation on graphs are also described. We then present several applications of our metho...
متن کاملA Domain-Decomposition-Free Parallelisation of the Fast Marching Method
The Fast Marching Method (FMM) is an efficient technique to numerically solve the eikonal equation. The parallelisation of the FMM is not easy because of its intrinsic sequential nature. In this paper we propose a novel approach to parallelise the FMM which is not based on a classic domain-decomposition procedure. Compared to other techniques in the field, our method is much simpler to implemen...
متن کامل